Algorithmic and Game-Theoretic Perspectives on Scheduling

نویسندگان

  • Nelson A. Uhan
  • Andreas S. Schulz
  • Dimitris Bertsimas
چکیده

In this thesis, we study three problems related to various algorithmic and game-theoretic aspects of scheduling. First, we apply ideas from cooperative game theory to study situations in which a set of agents faces supermodular costs. These situations appear in a variety of scheduling contexts, as well as in some settings related to facility location and network design. Although cooperation is unlikely when costs are supermodular, in some situations, the failure to cooperate may give rise to negative externalities. We study the least core value of a cooperative game—the minimum penalty we need to charge a coalition for acting independently that ensures the existence of an efficient and stable cost allocation—as a means of encouraging cooperation. We show that computing the least core value of supermodular cost cooperative games is strongly NP-hard, and design an approximation framework for this problem that in the end, yields a .3C /-approximation algorithm. We also apply our approximation framework to obtain better results for two special cases of supermodular cost cooperative games that arise from scheduling and matroid optimization. Second, we focus on the classic precedence-constrained single-machine scheduling problem with the weighted sum of completion times objective. We focus on so-called 0-1 bipartite instances of this problem, a deceptively simple class of instances that has virtually the same approximability behavior as arbitrary instances. In the hope of improving our understanding of these instances, we use models from random graph theory to look at these instances with a probabilistic lens. First, we show that for almost all 0-1 bipartite instances, the decomposition technique of Sidney (1975) does not yield a non-trivial decomposition. Second, for almost all 0-1 bipartite instances, we give a lower bound on the integrality gap of various linear programming relaxations of this problem. Finally, we show that for almost all 0-1 bipartite instances, all feasible schedules are arbitrarily close to optimal. Finally, we consider the problem of minimizing the sum of weighted completion times in a concurrent open shop environment. We present some interesting properties of various linear programming relaxations for this problem, and give a combinatorial primal-dual 2-approximation algorithm. Thesis Supervisor: Andreas S. Schulz Title: Associate Professor of Mathematics of Operations Research

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

NGTSOM: A Novel Data Clustering Algorithm Based on Game Theoretic and Self- Organizing Map

Identifying clusters is an important aspect of data analysis. This paper proposes a noveldata clustering algorithm to increase the clustering accuracy. A novel game theoretic self-organizingmap (NGTSOM ) and neural gas (NG) are used in combination with Competitive Hebbian Learning(CHL) to improve the quality of the map and provide a better vector quantization (VQ) for clusteringdata. Different ...

متن کامل

Welfare Impacts of Imposing a Tariff on Rice in Iran vs an Export Tax in Thailand: A Game Theoretic Approach

In this study, the social welfare impacts of the interaction of Iranian rice import policies and Thai export policies are analyzed using a game theoretic approach in conjunction with econometric supply and demand models. The joint impacts of increasing the world price of rice, resulting from the export policies in Thailand along with changes in tariff rates in Iran, on social welfare are analyz...

متن کامل

Algorithmic and game-theoretic approaches to group scheduling

Scheduling an event for a group of people is a notoriously frustrating task; it tends to be tedious, time consuming, and often leads to suboptimal schedules. One reason the problem has resisted a solution is that it has many dimensions, some of them easy to put one’s finger on, but others more subtle such as game-theoretic manipulability of the procedure. The first part of this work seeks algor...

متن کامل

Coordinating a decentralized supply chain with a stochastic demand using quantity flexibility contract: a game-theoretic approach

  Supply chain includes two or more parties linked by flow of goods, information, and funds. In a decentralized system, supply chain members make decision regardless of their decision's effects on the performance of the other members and the entire supply chain. This is the key issue in supply chain management, that the mechanism should be developed in which different objectives should be align...

متن کامل

A Game Theoretic Approach for Sustainable Power Systems Planning in Transition

Intensified industrialization in developing countries has recently resulted in huge electric power demand growth; however, electricity generation in these countries is still heavily reliant on inefficient and traditional non-renewable technologies. In this paper, we develop an integrated game-theoretic model for effective power systems planning thorough balancing between supply and demand for e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008